منابع مشابه
Uniform Distribution of Hasse Invariants
I. Schur's study of simple algebras around the turn of the century, nd subsequent investigations by R. Brauer, E. Witt and others, were later reformulated in terms of what is now called the Schur subgroup of the Brauer group. During the last twenty years this group has generated substantial interest and numerous palatable results have ensued. Among these is the discovery that elements of the Sc...
متن کاملHasse Invariants for Hilbert Modular Varieties
Given a totally real field L of degree g, we construct g Hasse invariants on Hilbert modular varieties in characteristic p and characterize their divisors. We show that these divisors give the type stratification defined by the action of {~L o n the ap-elementary subgroup. Under certain conditions, involving special values of zeta functions, the product of these Hasse invariants is the reductio...
متن کاملHasse Invariants for the Clausen Elliptic Curves
Gauss’s 2F1 ( 1 2 1 2 1 | x ) hypergeometric function gives periods of elliptic curves in Legendre normal form. Certain truncations of this hypergeometric function give the Hasse invariants for these curves. Here we study another form, which we call the Clausen form, and we prove that certain truncations of 3F2 ( 1 2 1 2 1 2 1 1 | x ) and 2F1 ( 1 4 3 4 1 | x ) in Fp[x] are related to the charac...
متن کاملDrinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields
We present a novel randomized algorithm to factor polynomials over a finite field Fq of odd characteristic using rank 2 Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial f ∈ Fq[x] to be factored) with respect to a random Drinfeld module φ with complex multiplication. Factors of f supported on prime ideals with supersin...
متن کاملInvariants algébriques de graphes et reconstruction
We report on results about a study of algebraic graph invariants, based on computer exploration, and motivated by graph-isomorphism and reconstruction problems. c © 2001 Académie des sciences/Éditions scientifiques et médicales Elsevier SAS Abridged English version Ulam’s reconstruction conjecture [3] asserts that a graph on n vertices, n > 3, is determined up to an isomorphism by the collectio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 2018
ISSN: 0373-0956,1777-5310
DOI: 10.5802/aif.3193